A Performance Evaluation of Fully Adaptive Wormhole Routing including Selection Function Choice
نویسنده
چکیده
Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however, has been done on determining how the selection function affects the performance of an adaptive routing algorithm. In this paper, we present a detailed simulation study of various selection functions for four different fully adaptive wormhole routing algorithms for 2D meshes. The simulation results show that the choice of selection function has a significant effect on the average message latency and saturation behavior. In fact, it appears that changing the selection function can have a greater effect than changing the routing algorithm. In addition, the best selection function for one adaptive routing algorithm may not be the best choice for another adaptive routing algorithm. An explanation and interpretation of the results is provided.
منابع مشابه
The Impact of Output Selection Function Choice on the Performance of Adaptive Wormhole Routing
Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however, has been done on determining how the output selection function (routing policy) affects the performance of an adaptive routing algorithm. In this paper, we present a detailed simulation study of various selection functions for a fully adaptive mesh routing algori...
متن کاملPerformance analysis of adaptive wormhole routing in a two-dimensional torus
This paper presents an analytical evaluation of the performance of adaptive wormhole routing in a two-dimensional torus. Our analysis focuses on minimal and fully adaptive wormhole routing that allows a message to use any shortest path between source and destination. A validation of the analysis through simulation is presented to demonstrate the accuracy of the obtained results. Finally, we rem...
متن کاملPerformance Analysis of Wormhole Switching with Adaptive Routing in a Two-Dimensional Torus
This paper presents an analytical evaluation of the performance of wormhole switching with adaptive routing in a two-dimensional torus. Our analysis focuses on minimal and fully adaptive routing that allows a message to use any shortest path between source and destination .
متن کاملCongestion estimation of router input ports in Network-on-Chip for efficient virtual allocation
Effective and congestion-aware routing is vital to the performance of network-on-chip. The efficient routing algorithm undoubtedly relies on the considered selection strategy. If the routing function returns a number of more than one permissible output ports, a selection function is exploited to choose the best output port to reduce packets latency. In this paper, we introduce a new selection s...
متن کاملAdaptive Multicast Wormhole Routing in 2d Mesh Multicomputers Adaptive Multicast Wormhole Routing in 2d Mesh Multicomputers
The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially-adaptive, minimal fully-adaptive, and nonminimal adaptive routing. All the algorithms, which are the rst deadlock-free adaptive multicast wormhole routing algorithms ever proposed, are show...
متن کامل